A Framework for Sparse, Non-Linear Least Squares Problems on Manifolds

ثبت نشده
چکیده

Ein Rahmen für dünnbesetzte, nichtlineare quadratische Ausgleichsrechnung auf Mannigfaltigkeiten qut—™hterX €rofF hrFEsngF …do prese €h hrF vutz ƒ™hröder vorgelegt dur™hX ghristoph rertz˜erg …niversität fremen xovem˜er PHHV Acknowledgements pirst of —ll s would like to th—nk …do prese for o'ering me this ™omplex ˜ut —lso interesting —nd exiting topi™D for the ™onstru™tive dis™ussionsD the m—ny useful suggestions —nd inform—tionsD —s well —s for providing me with sever—l d—t— sets needed to ev—lu—te this thesisF s like to th—nk törg uurl˜—um for implementing —n e—rly ex—mple using this fr—meworkD —nd his feed˜—™k whi™h led to m—ny interf—™e improvementsF purthermore s th—nk vutz ƒ™hröder for volunteering to ˜e the se™ond reviewer for this thesisF pin—lly s th—nk my f—mily for supporting me during my studies —nd during my whole lifeF

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Non-linear Least Squares Optimization for Geometric Vision

Several estimation problems in vision involve the minimization of cumulative geometric error using non-linear least-squares fitting. Typically, this error is characterized by the lack of interdependence among certain subgroups of the parameters to be estimated, which leads to minimization problems possessing a sparse structure. Taking advantage of this sparseness during minimization is known to...

متن کامل

Tensor Methods for Large, Sparse Nonlinear Least Squares Problems

This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by nite diier-ence approximations. Tensor methods have been shown to have very good computational performance for small to medium-sized, dense nonlinear least squares problems. In this paper we consider the application of tensor metho...

متن کامل

Solving Rank-Deficient Linear Least-Squares Problems*

Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...

متن کامل

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides' primal-dual simplex-type algorithm

In a recent primal-dual simplex-type algorithm [K. Paparrizos, N. Samaras and G. Stephanides, 2003, A new efficient primal dual simplex algorithm. Computers & Operations Research 30, 1383–1399], their authors show how to take advantage of the knowledge of a primal feasible point and they work with a square basis during the whole process. In this paper we address what could be thought of as its ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008